Using a Graph Transformation Tool to generate a Parser

نویسنده

  • Peter van Dijk
چکیده

Graph transformation tools (GTTs) are powerful tools for analysing syntax trees. In the state of the art importing syntax trees in GTTs requires a format-specific converter that is prone to changes. This research solves the dependence on import tools by using the GROOVE GTT to subsume all steps involved in creating the syntax tree. Consequently our approach is wholly defined in terms of graph transformations for both the LL(1) parser and its generator. We find that our approach is indeed correct and complete, but suffers a performance penalty in comparison to traditional parsers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature Engineering in Persian Dependency Parser

Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...

متن کامل

Layout Preserving Parser for Refactoring in Erlang

This paper describes preprocessor and whitespace-aware tools for parsing and transforming Erlang source code. The presented tools are part of RefactorErl, a refactoring tool for Erlang programs. RefactorErl represents programs as a ”semantic graph” that extends the AST with semantic nodes and edges for efficient information retrieval. The paper focuses on describing the construction of the AST ...

متن کامل

Generic syntactic analyser: ParsErl

The increasing demand in automatic code transformation tools – which can preserve the layout, and can handle the whole macro syntax – led us to develop our scanner and parser tool. ParsErl is a generic syntactic analyser for Erlang. The scanner and the parser are generated from an XML definition of the grammar. The result of the scanning process is a graph, which can be optimised or balanced fo...

متن کامل

Solving the TTC 2011 Reengineering Case with Henshin

Models are a helpful means of representing different aspects of a software system more abstractly to improve comprehension. In the modeling community, the Eclipse Modeling Framework (EMF) [6] has evolved to a widely used technology. While EMF itself provides modeling and code generation capabilities, extensions such as the Java Model Parser and Printer (JaMoPP) allow the translation of Java sou...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014